Combinatorial R-Matrices for Kirillov–Reshetikhin Crystals of Type D(1)n, B(1)n, A(2)2n−1

the second immanant of some combinatorial matrices

let $a = (a_{i,j})_{1 leq i,j leq n}$ be an $n times n$ matrixwhere $n geq 2$. let $dt(a)$, its second immanant be the immanant corresponding to the partition $lambda_2 = 2,1^{n-2}$. let $g$ be a connected graph with blocks $b_1, b_2, ldots b_p$ and with$q$-exponential distance matrix $ed_g$. we given an explicitformula for $dt(ed_g)$ which shows that $dt(ed_g)$ is independent of the manner in ...

Combinatorial Eigenvalues of Matrices

Let S be a subset of diagonal entries of an n × n complex matrix A. When the members of S have a common value which is equal to an eigenvalue of A, then S is a critical diagonal set of A. The existence of such a set is equivalent to the matrix Ã, obtained from A by setting its diagonal entries equal to zero, having an s × t zero submatrix with s + t ≥ n + 1. If S is a minimal critical diagonal ...

Some Remarkable Combinatorial Matrices

In this paper we describe, in combinatorial terms, some matrices which arise as Laplacians connected to the three-dimensional Heisenberg Lie algebra. We pose the problem of finding the eigenvalues and eigenvectors of these matrices. We state a number of conjectures including the conjecture that all eigenvalues of these matrices are non-negative integers. We determine the eigenvalues and eigenve...

Combinatorial Characterizations of K-matrices

We present a number of combinatorial characterizations of Kmatrices. This extends a theorem of Fiedler and Pták on linearalgebraic characterizations of K-matrices to the setting of oriented matroids. Our proof is elementary and simplifies the original proof substantially by exploiting the duality of oriented matroids. As an application, we show that a simple principal pivot method applied to th...

Lower bounds of Copson type for the transpose of matrices on weighted sequence spaces